منابع مشابه
Finding regular insertion encodings for permutation classes
Permutation classes, or restricted permutations, have received considerable attention over the past two decades, and during this time a great variety of techniques have been used to enumerate them. One of the most popular approaches, pioneered by Chung, Graham, Hoggatt, and Kleiman [4], employs generating trees. The permutation classes with finitely labeled generating trees were characterized i...
متن کاملEncodings and Arithmetic Operations in Membrane Computing
Membrane systems represent a new abstract model inspired by cell compartments and molecular membranes. Such a system is composed of various compartments, each compartment with a different task, and all of them working simultaneously to accomplish a more general task of the whole system. A detailed description of the membrane systems (also called P systems) can be found in [7]. A membrane system...
متن کاملComputing in permutation groups without memory
Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijecti...
متن کاملComputing conjugacy class representatives in permutation groups
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permutation group with trivial soluble radical. We rely on existing methods for groups that are almost simple, and we are concerned here only with the reduction of the general case to the almost simple case. Dedicated to Charles Leedham-Green on the occasion of his 65th birthday
متن کاملPermutation groups, minimal degrees and quantum computing
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group H ≤ Sn of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 1999
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s001650050036